On the number of edges not covered by monochromatic copies of a fixed graph

On the number of edges not covered by monochromatic copies of a fixed graph

For a fixed graph H; let f ðn;HÞ denote the maximum possible number of edges not belonging to a monochromatic copy of H in a 2-edge-coloring of the complete graph of order n: Let exðn;HÞ be the Turán number of H; i.e., the maximum number of edges that a graph on n vertices can have without containing a copy of H: An easy lower bound of f ðn;HÞXexðn;HÞ follows from the 2-edge-coloring in which t...

On edges not in monochromatic copies of a fixed bipartite graph

Let H be a fixed graph. Denote f(n,H) to be the maximum number of edges not contained in any monochromatic copy of H in a 2-edge-coloring of the complete graph Kn, and ex(n,H) to be the Turán number of H . An easy lower bound shows f(n,H) ≥ ex(n,H) for any H and n. In [9], Keevash and Sudakov proved that if H is an edge-color-critical graph or C4, then f(n,H) = ex(n,H) holds for large n, and th...

The Maximum Number of Edges in a Strongly Multiplicative Graph

a study on insurer solvency by panel data model: the case of iranian insurance market

the aim of this thesis is an approach for assessing insurer’s solvency for iranian insurance companies. we use of economic data with both time series and cross-sectional variation, thus by using the panel data model will survey the insurer solvency.

investigation of effective parameters on the rigidity of light composite diaphragms (psscb) by fem

در این رساله با معرفی سقف های psscb متشکل از ترکیب ورق های فولادی ذوزنقه ای و تخته های سیمانی الیافی به عنوان سقف های پیش ساخته (سازگار با سیستم سازه ای قاب های فولادی سبک) به بررسی پارامترهای موثر بر صلبیت سقف، پرداخته می شود. در تحقیق حاضر ابتدا به مدل سازی دو نمونه سقف آزمایش شده، به روش اجزاء محدود با استفاده از نرم افزار تحلیلی abaqus ver 6.10 پرداخته شده است. نمونه های ساخته شده تحت اعما...